Accounting for Round-Off Errors When Using Gradient Minimization Methods

نویسندگان

چکیده

This paper discusses a method for taking into account rounding errors when constructing stopping criterion the iterative process in gradient minimization methods. The main aim of this work was to develop methods improving quality solutions real applied problems, which require significant amounts calculations and, as result, can be sensitive accumulation errors. However, demonstrates that developed approach also useful solving computationally small problems. ideas are demonstrated using one possible implementations conjugate an overdetermined system linear algebraic equations with dense matrix.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Accounting for Errors When Using Systems Approaches

Complex systems problems require the use of a formal philosophical construct and dictate the use of a rigorous systems approach. A systems approach may utilize one of a variety of proven methods, but in each case it involves the imposition of order that ranges from the philosophical to the procedural. Independent of the construct or rigor used to address the complex systems problem is the oppor...

متن کامل

Reducing round-off errors in symmetric multistep methods

Certain symmetric linear multistep methods have an excellent long-time behavior when applied to second order Hamiltonian systems with or without constraints. For high accuracy computations round-off can be the dominating source of errors. This article shows how symmetric multistep methods should be implemented, so that round-off errors are minimized and propagate like a random walk.

متن کامل

Periodicity and Transport from Round-Off Errors

AMS Subject Classi cation: 58F20, 60J60, 65G05 We investigate the effects of round-off errors on quasi-periodic motions in a linear symplectic planar map. By discretizing coordinates uniformly we transform this map into a permutation of Z2 , and study motions near infinity, which correspond to a fine discretization. We provide numerical evidence that all orbits are periodic and that the average...

متن کامل

A KAM type theorem for systems with round-off errors

Perturbations due to round-off errors in computer modeling are discontinuous and therefore one cannot use results like KAM theory about smooth perturbations of twist maps. We elaborate a special approximation scheme to construct two smooth periodic on the angle perturbations of the twist map, bounding the discretized map from above and from below. Using the well known Moser’s theorem we prove t...

متن کامل

Gradient Convergence in Gradient methods with Errors

We consider the gradient method xt+1 = xt + γt(st + wt), where st is a descent direction of a function f : �n → � and wt is a deterministic or stochastic error. We assume that ∇f is Lipschitz continuous, that the stepsize γt diminishes to 0, and that st and wt satisfy standard conditions. We show that either f(xt) → −∞ or f(xt) converges to a finite value and ∇f(xt) → 0 (with probability 1 in t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algorithms

سال: 2022

ISSN: ['1999-4893']

DOI: https://doi.org/10.3390/a15090324